Finding Experts in Unstructured Communities through Relationships and Topics
نویسندگان
چکیده
The problem of expert finding has been explored for many structured question and answer-based social networks. Less explored is the problem of finding trusted individuals in an unstructured social setting. We explore the issue of finding experts in Reddit’s /r/programming, /r/CFB and /r/cars Subreddit – each of which is either unstructured or semi-structured – using a machine learning approach based on prior research in classifying user roles. To target the problem, we assumed that "experts" is a role similar to "answer-person" in previous research in that they have a common pattern of communication quantitatively recognizable through analysis of social network features. Using a combination of inferred topic distributions and social network structure, we trained a supervised classifer to find the topical-network "fingerprint" of experts. Among features examined for a given user include neighbor topical similarity, topical entropy, and depth 2-egocentric network properties. We compare our results with previously considered techniques for evaluating expertise: namely, ExpertiseRank (Social Network Page Rank), HITS and a simple z-score metric introduced by Zhang, Ackerman and Adamic (2007). Using our role-based algorithm, average f1 and recall scores during validation demonstrate comparable or better performance than prior social network analysis-based algorithms. We conclude by describing future metrics that can be explored in the problem of expert classifying in pure discussion communities.
منابع مشابه
Taxonomy-Driven Expertise Aggregation on Bibliographic Data
Finding relevant experts is essential for collaboration. Many Expert Finder applications succeed in finding experts, only at coarse levels of granularity, and within specific domains. Finding experts at fine granularity however, is often needed for effective functioning. Semantics can refine the granularity at which the expertise of various experts can be determined, by explicitly expressing re...
متن کاملSEMEF: A Taxonomy-Based Discovery of Experts, Expertise and Collaboration Networks
Finding relevant experts in research is often critical and essential for collaboration. Semantics can be useful in this process. In particular, a taxonomy of Computer Science topics, together with an ontology of publications can be glued through explicit relationships from papers to one or more topics. These paper-totopics relationships, extracted from paper abstracts and keywords are valuable ...
متن کاملTemporal expert finding through generalized time topic modeling
Please cite this article in press as: A. Daud et al., j.knosys.2010.04.008 This paper addresses the problem of semantics-based temporal expert finding, which means identifying a person with given expertise for different time periods. For example, many real world applications like reviewer matching for papers and finding hot topics in newswire articles need to consider time dynamics. Intuitively...
متن کاملInvestigating the Difference between Experts and Local Communities Viewpoints on the Use of Rangeland by Products (Case Study: Azadshahr and Gonbad Rangelands)
In the field of natural resource’s utilization and management, the two groups of stakeholders, utilizers and official experts are not quite agreed. It is obvious that each of these two social groups, depending on their interests and duties, have different points of views, as a result different plans for the development and managent. Finding the differences thus, could be effective in decision m...
متن کاملیک مدل موضوعی احتمالاتی مبتنی بر روابط محلّی واژگان در پنجرههای همپوشان
A probabilistic topic model assumes that documents are generated through a process involving topics and then tries to reverse this process, given the documents and extract topics. A topic is usually assumed to be a distribution over words. LDA is one of the first and most popular topic models introduced so far. In the document generation process assumed by LDA, each document is a distribution o...
متن کامل